Maximum Entropy, Parallel Computation and Lotteries
نویسنده
چکیده
By picking unpopular sets of numbers in a lottery, it is possible to increase one’s expected winnings. We have used the Maximum Entropy method to estimate the probability of each of the 14 million tickets being chosen by players in the UK National Lottery. We discuss the parallel solution of the non-linear system of equations on a variety of platforms and give results which indicate the returns achieved by a syndicate buying a large number of tickets each week.
منابع مشابه
Similarity Based Smoothing In Language Modeling
In this paper, we improve our previously proposed Similarity Based Smoothing (SBS) algorithm. The idea of the SBS is to map words or part of sentences to an Euclidean space, and approximate the language model in that space. The bottleneck of the original algorithm was to train a regularized logistic regression model, which was incapable to deal with real world data. We replace the logistic regr...
متن کاملExplaining Heterogeneity in Risk Preferences Using a Finite Mixture Model
This paper studies the effect of the space (distance) between lotteries' outcomes on risk-taking behavior and the shape of estimated utility and probability weighting functions. Previously investigated experimental data shows a significant space effect in the gain domain. As compared to low spaced lotteries, high spaced lotteries are associated with higher risk aversion for high probabilities o...
متن کاملEvolution, Entropy, and Parallel Computation
In this paper the relationship between evolution and entropy is described for a model of self-reproducing parallel computation. As was recently shown [5], the performance of some types of parallel computation can be increased though a process analogous to evolution by natural selection. The work discussed in this paper explores the process by which evolution manipulates the entropy of instructi...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملCOMPTEL skymapping : a new approach using parallel computing
Large-scale skymapping with COMPTEL using the full survey database presents challenging problems on account of the complex response and time-variable background. A new approach which attempts to address some of these problems is described, in which the information about each observation is preserved throughout the analysis. In this method, a maximum-entropy algorithm is used to determine image ...
متن کامل